package HOT;

/**
 * Author  zxy
 * Date  2023/6/19 下午 3:21
 */
public class MinDistance {
    public int minDistance(String word1, String word2) {

        int len1 = word1.length();
        int len2 = word2.length();

        int[][] dp = new int[len1 + 1][len2 + 1];

        for (int i = 0; i <= len1; i++) {
            dp[i][0] = i;
        }

        for (int i = 0; i <= len2; i++) {
            dp[0][i] = i;
        }

        for (int i = 1; i <= len1; i++) {
            for (int j = 1; j <= len2; j++) {
                if (word1.charAt(i - 1) == word2.charAt(j - 1)) {
                    dp[i][j] = dp[i - 1][j - 1];
                }
                else {
                    int replace = dp[i - 1][j - 1] + 1;
                    int insert = dp[i - 1][j] + 1;
                    int del = dp[i][j - 1] + 1;

                    dp[i][j] = Math.min(Math.min(replace, insert), del);
                }
            }
        }

        return dp[len1][len2];

    }
}
